A composition theorem for decision tree complexity
نویسنده
چکیده
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g◦ ( f 1, . . . , f n), where each relation f i is booleanvalued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions.
منابع مشابه
A Composition Theorem via Conflict Complexity
Let R(·) stand for the bounded-error randomized query complexity. We show that for any relation f ⊆ {0, 1}×S and partial Boolean function g ⊆ {0, 1}×{0, 1}, R1/3(f ◦g ) = Ω(R4/9(f)·
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملRandomized Query Complexity of Sabotaged and Composed Functions
We study the composition question for bounded-error randomized query complexity: Is R(f ◦ g) = Ω(R(f)R(g)) for all Boolean functions f and g? We show that inserting a simple Boolean function h, whose query complexity is only Θ(logR(g)), in between f and g allows us to prove R(f ◦ h ◦ g) = Ω(R(f)R(h)R(g)). We prove this using a new lower bound measure for randomized query complexity we call rand...
متن کاملA Composition Theorem for Conical Juntas
We describe a general method of proving degree lower bounds for conical juntas (nonnegative combinations of conjunctions) that compute recursively defined boolean functions. Such lower bounds are known to carry over to communication complexity. We give two applications: • AND-OR trees. We show a near-optimal Ω̃(n0.753...) randomised communication lower bound for the recursive NAND function (a.k....
متن کاملComparing different stopping criteria for fuzzy decision tree induction through IDFID3
Fuzzy Decision Tree (FDT) classifiers combine decision trees with approximate reasoning offered by fuzzy representation to deal with language and measurement uncertainties. When a FDT induction algorithm utilizes stopping criteria for early stopping of the tree's growth, threshold values of stopping criteria will control the number of nodes. Finding a proper threshold value for a stopping crite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Chicago J. Theor. Comput. Sci.
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014